On Pairwise Kernels: An Efficient Alternative and Generalization Analysis
نویسندگان
چکیده
Pairwise classification has many applications including network prediction, entity resolution, and collaborative filtering. The pairwise kernel has been proposed for those purposes by several research groups independently, and become successful in various fields. In this paper, we propose an efficient alternative which we call Cartesian kernel. While the existing pairwise kernel (which we refer to as Kronecker kernel) can be interpreted as the weighted adjacency matrix of the Kronecker product graph of two graphs, the Cartesian kernel can be interpreted as that of the Cartesian graph which is more sparse than the Kronecker product graph. Experimental results show the Cartesian kernel is much faster than the existing pairwise kernel, and at the same time, competitive with the existing pairwise kernel in predictive performance. We discuss the generalization bounds by the two pairwise kernels by using eigenvalue analysis of the kernel matrices.
منابع مشابه
Cartesian Kernel: An Efficient Alternative to the Pairwise Kernel
Pairwise classification has many applications including network prediction, entity resolution, and collaborative filtering. The pairwise kernel has been proposed for those purposes by several research groups independently, and has been used successfully in several fields. In this paper, we propose an efficient alternative which we call a Cartesian kernel. While the existing pairwise kernel (whi...
متن کاملCompiler-Optimized Kernels: An Efficient Alternative to Hand-Coded Inner Kernels
The use of highly optimized inner kernels is of paramount importance for obtaining efficient numerical algorithms. Often, such kernels are created by hand. In this paper, however, we present an alternative way to produce efficient matrix multiplication kernels based on a set of simple codes which can be parameterized at compilation time. Using the resulting kernels we have been able to produce ...
متن کاملEfficient Pairwise Learning Using Kernel Ridge Regression: an Exact Two-Step Method
Pairwise learning or dyadic prediction concerns the prediction of properties for pairs of objects. It can be seen as an umbrella covering various machine learning problems such as matrix completion, collaborative filtering, multi-task learning, transfer learning, network prediction and zero-shot learning. In this work we analyze kernel-based methods for pairwise learning, with a particular focu...
متن کاملActions, Norms, Subactions and Kernels of (Fuzzy) Norms
In this paper, we introduce the notion of an action $Y_X$as a generalization of the notion of a module,and the notion of a norm $vt: Y_Xto F$, where $F$ is a field and $vartriangle(xy)vartriangle(y') =$ $ vartriangle(y)vartriangle(xy')$ as well as the notion of fuzzy norm, where $vt: Y_Xto [0, 1]subseteq {bf R}$, with $bf R$ the set of all real numbers. A great many standard mappings on algebr...
متن کاملIntegrating the Goler Matrix Method and the List of Indicators to Specify an Efficient Alternative on Elevating the Quality of Ecological Functions of the River Borders (Case Study: Abshooran River in Kermanshah, Iran)
The purpose behind this research, which is done on the Abshooran river in Kermanshah and in the area between Delgosha bridge and wooden bridge is to develop lively and active urban centers and to elevate the quality functions of the region and the ecological conditions of the river’s border. To reach for this goal, ecological and aesthetic criteria were in use in a way that proposed alternative...
متن کامل